منابع مشابه
Equality of proofs for linear equality
This paper is about equality of proofs in which a binary predicate formalizing properties of equality occurs, besides conjunction and the constant true proposition. The properties of equality in question are those of a preordering relation, those of an equivalence relation, and other properties appropriate for an equality relation in linear logic. The guiding idea is that equality of proofs is ...
متن کاملThe Algebra of Equality Proofs
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-premise rule taking a proof of x=y and returning a proof of y=x; and transitivity is a 2-premise rule taking proofs of x=y and y=z, and returning a proof of x=z. Define an equivalence relation to hold between proofs iff ...
متن کاملEquality in Linear Logic
1 Quantales In this section we introduce the basic deenitions and results of the theory of quantales (a good reference is Ros]). Quantales were introduced by Mulvey ((Mul]) as an algebraic tool for studying representations of non-commutative C-algebras. Informally, a quantale is a complete lattice Q equipped with a product distributive over arbitrary sup's. The importance of quantales for Linea...
متن کاملStability in possibilistic linear equality
We consider linear equality systems where all the parameters may be fuzzy variables specified by their possibility distribution, the operations addition and multiplication by a real number of fuzzy parameters are defined via a suptriangular norm composition, and the equations are understood in possibilistic sense. We show that when the triangular norm defining the operations and equations is co...
متن کاملRobust Filtering for Linear Equality Constrained Systems
This paper deals with the robust filtering problem for linear discrete-time constrained systems. The purpose is the design of a linear filter such that the resulting error system is bounded. An orthogonal factorization is used to decompose the original robust filtering problem into stochastic and deterministic parts, which are then solved separately. Finally, a numerical example is presented to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2008
ISSN: 0933-5846,1432-0665
DOI: 10.1007/s00153-008-0096-0